Associative learning of Boolean functions
نویسندگان
چکیده
منابع مشابه
Associative Learning of Boolean Functions
Ahstruet -A cooperative game playing learning automata model is presented for learning a complex nonlinear associative task, namely learning of Boolean functions. The unknown Boolean function is expressed in terms of minterms, and a team of automata is used to learn the minterms present in the expansion. Only noisy outputs of the Boolean function are assumed to be available for the team of auto...
متن کاملLearning Boolean Functions Incrementally
Classical learning algorithms for Boolean functions assume that unknown targets are Boolean functions over fixed variables. The assumption precludes scenarios where indefinitely many variables are needed. It also induces unnecessary queries when many variables are redundant. Based on a classical learning algorithm for Boolean functions, we develop two learning algorithms to infer Boolean functi...
متن کاملLearning Boolean Functions
2 Probabilistic modelling of learning 4 2.1 A probabilistic model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 A learnability result for Boolean classes . . . . . . . . . . . . . . . . . . . . 6 2.4 Learning monomials . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.5 Di...
متن کاملOn Learning Monotone Boolean Functions
Abstract We consider the problem of learning monotone Boolean functions over under the uniform distribution. Specifically, given a polynomial number of uniform random samples for an unknown monotone Boolean function , and given polynomial computing time, we would like to approximate as well as possible. We describe a simple algorithm that we prove achieves error at most , improving on the previ...
متن کامل2 Learning Monotone Boolean Functions
Last time we finished the discussion about KM algorithm and its application. We also covered sparse Fourier representations and k-juntas of parities. In the end we started to talk about learning monotone Boolean functions and influence of such functions. Today We will first finish discussion about learning monotone Boolean functions. Then we will also talk about learning k-juntas of halfspaces....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man, and Cybernetics
سال: 1989
ISSN: 0018-9472
DOI: 10.1109/21.44015